Tradi(visão) e Tradu(visão) em O Último voo do flamingo de Mia Couto
نویسندگان
چکیده
منابع مشابه
Redes de conhecimento em ciências e o compartilhamento do conhecimento
qwertyuiopasdfghjklzxcvbnmqwerty uiopasdfghjklzxcvbnmqwertyuiopasd fghjklzxcvbnmqwertyuiopasdfghjklzx cvbnmqwertyuiopasdfghjklzxcvbnmq wertyuiopasdfghjklzxcvbnmqwertyui opasdfghjklzxcvbnmqwertyuiopasdfg hjklzxcvbnmqwertyuiopasdfghjklzxc vbnmqwertyuiopasdfghjklzxcvbnmq wertyuiopasdfghjklzxcvbnmqwertyui opasdfghjklzxcvbnmqwertyuiopasdfg hjklzxcvbnmqwertyuiopasdfghjklzxc vbnmqwertyuiopasdfghjklzxc...
متن کاملAnálise e modelagem do comportamento de SPAMMERS e dos usuários legítimos em redes de email
Email is an increasingly important and ubiquitous mean of communication, both facilitating contact between individuals and enabling rises in the productivity of organizations. However, the relentless rising of automatic unauthorized emails, also known as spam, is eroding away much of the attractiveness of email communication. Most of the attention dedicated to spam detection has focused on the ...
متن کاملUm Estudo Do Potencial De Redes Intrachip Para O Escalonamento De Processos Em Arquiteturas Multicore
of Dissertation presented to COPPE/UFRJ as a partial fulfillment of the requirements for the degree of Master of Science (M.Sc.) A STUDY OF POTENTIAL OF INTRACHIP NETWORKS FOR SCHEDULING PROCESS IN MULTICORE ARCHITECTURES Alexandre Borges Gonçalves
متن کاملMelhorando o Desempenho do Processamento de Consultas Drill-Across em Ambientes de Data Warehousing
In this paper we propose two algorithms aimed at increasing the performance of drill-across queries in data warehousing environments. The JMG algorithm is used when numeric measures of different data warehouses are usually required together. The EG-JM algorithm extends the first one also considering storage requirements. The performance tests carried out using the TPC-H benchmark showed a huge ...
متن کاملO Problema do Subgrupo Oculto em uma Classe de Produto Semidireto de Grupos
We present an efficient quantum algorithm for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups Zpr oφ Zps , where p is any odd prime number and r and s are any positives integers such that r ≥ 2s. This quantum algorithm is exponentially more efficient than any classical algorithm for the same purpose. Resumo. Neste trabalho, apresentamos um algoritmo quântico eficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Estudos Universitários - REU
سال: 2016
ISSN: 2177-5788,0102-6437
DOI: 10.22484/2177-5788.2016v42n1p199-212